#include<iostream>
#include<algorithm>
using namespace std;

typedef long long ll;
const int N = 1e5 + 10;
ll n, k;
ll a[N];

int colc(int x){
	ll ret = 0;
	for(int i = 1; i <= n; i++){
		ret += a[i] / x;
	}
	return ret;
}

int main(){
	cin >> n >> k;
	for(int i = 1; i <= n; i++) cin >> a[i];
	sort(a + 1, a + 1 + n);
	ll l = 0, r = 1e8;
	while(l < r){
		int mid = (l + r + 1) / 2;
		if(colc(mid) >= k) l = mid;
		else r = mid - 1;
	} 
	cout <<  l << endl;
	return 0;
}

